Using Subobservers to Synthesize Opacity-Enforcing Supervisors

In discrete-event system control, the worst-case time complexity for computing a system's observer is exponential in number of that states. This results practical difficulties since some problems require calculating multiple observers changing system, e.g., synthesizing an opacity-enforcing supervisor. Although these iterative manner allows us to synthesize supervisor and although methods have been proposed reduce computational demands, room exists intuitive solution. Here we extend subautomaton relationship notion subobserver demonstrate its use reducing computations required iterated calculations. We then relationship's power by simplifying state-of-the-art synthesis approaches supervisors under realistic assumptions.